Bit indexed explicit replication for layer 2 networking

ABSTRACT

Functionality for creating a bit routing table for use in a bit-indexed explicit replication (“BIER”) environment in disclosed herein. In one embodiment, this functionality includes receiving information from a host, and determining whether the information comprises a MAC address that is a bit-indexed explicit replication (“BIER”) MAC address. In response to determining that the information comprises a BIER MAC address, this functionality creates an entry corresponding to the MAC address in a bit routing table. This functionality also analyzes the information to determine a bit position that is associated with the host, and also determines a port via which the host is reachable. The functionality updates the bit routing table by storing information identifying the bit position and the port in the entry, such that the bit position and the port both correspond to the MAC address. This functionality can be used to route packets in a BIER environment.

RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 16/237,575 entitled “Bit Indexed Explicit Replication for Layer 2 Networking” filed Dec. 31, 2018; which is a continuation of U.S. application Ser. No. 14/536,153, entitled “Bit Indexed Explicit Replication for Layer 2 Networking” filed Nov. 7, 2014, which issued as U.S. Pat. No. 10,218,524 on Feb. 26, 2019; which is a continuation-in-part of U.S. application Ser. Nos. 14/488,761, 14/488,790, and 14/488,810; with further details of U.S. application Ser. Nos. 14/488,761, 14/488,790 and 14/488,810 being as follows:

U.S. application Ser. No. 14/488,761 is entitled “Bit Indexed Explicit Replication” filed Sep. 17, 2014, which issued as U.S. Pat. No. 9,853,822 on Dec. 26, 2017; and in turn claims the domestic benefit under Title 35 of the United States Code § 119(e) of U.S. Provisional Application Nos. 61/878,693 entitled “Multicast IPv6 with Bit Mask Forwarding” filed Sep. 17, 2013, and 61/931,473 entitled “Bit Mask Forwarding Architectures for Stateless Multipoint Replication” filed Jan. 24, 2014.

U.S. application Ser. No. 14/488,790 is entitled “Bit Indexed Explicit Replication Using Multiprotocol Label Switching” filed Sep. 17, 2014 which issued as U.S. Pat. No. 10,225,090 on Mar. 5, 2019; and in turn claims the domestic benefit under Title 35 of the United States Code § 119(e) of U.S. Provisional Application Nos. 61/878,693, entitled “Multicast IPv6 with Bit Mask Forwarding,” filed Sep. 17, 2013 and 61/931,473 entitled “Bit Mask Forwarding Architectures for Stateless Multipoint Replication” filed Jan. 24, 2014.

U.S. application Ser. No. 14/488,810 is entitled “Bit Indexed Explicit Replication Using Internet Protocol Version 6” and was filed Sep. 17, 2014 which issued as U.S. Pat. No. 9,942,053 on Apr. 10, 2018, and in turn claims the domestic benefit under Title 35 of the United States Code § 119(e) of U.S. Provisional Application Nos. 61/878,693 entitled “Multicast IPv6 with Bit Mask Forwarding” filed Sep. 17, 2013 and 61/931,473 entitled “Bit Mask Forwarding Architectures for Stateless Multipoint Replication” filed Jan. 24, 2014.

All provisional and non-provisional applications referenced above are hereby incorporated by reference in their entirety and for all purposes as if completely and fully set forth herein.

BACKGROUND OF THE INVENTION

Network nodes forward data. Network nodes may take form in one or more routers, one or more bridges, one or more switches, one or more servers, or any other suitable communications processing device. The data is commonly formatted as packets and forwarded using forwarding tables. A packet is a formatted unit of data that typically contains control information and payload data. Control information may include: information that identifies sources and destinations, such as addresses, error detection codes like checksums, sequencing information, etc. Control information is typically found in packet headers and trailers. Payload data is typically located between the packet headers and trailers.

Forwarding packets involves various processes that, while simple in concept, can be complex. The processes involved in forwarding packets vary, depending on the type of forwarding method used. Multicast is the preferred method of data forwarding for many networks. One reason for this is that multicast is a bandwidth-conserving technology that reduces traffic by simultaneously delivering data to multiple receivers. However, some network environments are not well suited to support multicast. Doing so in such environments often involves discovering and maintaining significant amounts of control, or state, information. Setting up and maintaining this control information has a tendency to become complex and costly in terms of computing resources, and can become a major limiting factor in overall network performance. Another issue with multicast is that due to packet delivery mechanisms used, packets are sometimes forwarded to locations where the packets were not desired. This unnecessary delivery of packets represents an unwelcome burden on network performance Overcoming this burden by traditional means involves generation and maintenance of even more control information.

BRIEF DESCRIPTION OF THE DRAWINGS

The present disclosure may be better understood, and its numerous objects, features, and advantages made apparent to those skilled in the art by referencing the accompanying drawings.

FIG. 1 is a simplified block diagram illustrating certain components of an example network.

FIG. 2 is a simplified block diagram illustrating certain components of an example network.

FIG. 3 is a simplified block diagram illustrating certain components of an example network.

FIG. 4 is a flow chart illustrating an example process employed by a host of FIG. 3 .

FIG. 5 is an example MAC address encoding.

FIG. 6A is a flow chart illustrating an example process employed by a host of FIG. 3 .

FIG. 6B is an example table generated by node of FIG. 3 .

FIG. 6C is an example table generated by node of FIG. 3 .

FIG. 7A is a flow chart illustrating an example process employed by a host of FIG. 3 .

FIG. 7B is an example table generated by node of FIG. 3 .

FIG. 7C is an example table generated by node of FIG. 3 .

FIG. 8A is a flow chart illustrating an example process employed by a switch of FIG. 3 .

FIG. 8B is a flow chart illustrating an example process employed by a switch of FIG. 3 .

FIG. 9 is an example packet format.

FIG. 10 is a flow chart illustrating an example process employed by a switch of FIG. 3 .

FIG. 11 is a block diagram illustrating certain components of an example node that can be employed in the network of FIG. 3 .

FIG. 12 is a block diagram depicting a computer system suitable for implementing embodiments of the systems described herein.

FIG. 13 is a block diagram depicting a network device suitable for implementing embodiments of the systems described herein.

DETAILED DESCRIPTION

Overview

Various systems and methods for performing bit indexed explicit replication (BIER). For example, one method involves receiving a link layer protocol frame at a network device. The link layer protocol frame includes a MAC address that identifies the link layer protocol frame as a being a multicast frame. The method then involves selecting a subset of ports included on the network device and forwarding the link layer protocol frame to only the selected subset of ports.

Layer 2 Multicast

Multicast delivers multicast data packets (data packets that traditionally include information identifying a multicast group, such as a multicast group address) from a source to multiple receivers without unduly burdening the source. As used herein, the term “source” signifies a network device that is identified (e.g., by registering as a source) as transmitting multicast data packets associated with a particular group or groups. As used herein, the term “receiver” signifies a host (such as a computing device or application) that has subscribed to a multicast group.

Multicast is traditionally implemented at layer 3 (the network layer) of the Open Systems Interconnection (OSI) model of networking. As implemented at layer 3, instead of a source replicating a multicast data packet and forwarding a separate copy of the multicast data packet to each receiver who has joined a given multicast group, the source forwards a single copy of the multicast data packet, and downstream multicast-enabled layer 3 devices, such as routers, replicate the multicast data packet at the point(s) where paths to various receivers diverge. Layer 3 multicast routing protocols are used to build multicast distribution trees from receivers towards sources. The multicast distribution trees are used in transmission of multicast data packets with replication close to the receivers of the multicast data packets. This saves network bandwidth and improves throughput.

Layer 2 networking protocols are less effective in implementing multicast than layer 3 networking protocols. Layer 3 domains typically include layer 3 devices, such as routers, while layer 2 domains typically include layer 2 devices, such as switches. The term “switch” is used herein to refer to any layer 2 networking device. Traditionally, when a multicast data packet is forwarded to a network device in a layer 2 domain, e.g., a switch, the switch floods the multicast data packet to all ports on the switch. This has the effect of flooding the multicast data packet to all switches in the layer 2 domain as well as all hosts connected to the switch. Flooding multicast data packets to all switches and all ports in the layer 2 domain results in the multicast data packets being forwarded to devices and hosts that have not requested the multicast data packets (e.g., have not joined multicast groups corresponding to the multicast data packets). Such unnecessary packet replication and forwarding is inefficient and represents a burden on network resources, such as processing, storage and transmission bandwidth.

One factor that contributes to inefficient handling of multicast data packets is that layer 2 does not fully support multicast group addresses. While some efforts have been made to translate layer 3 multicast group addresses into layer 2 multicast group addresses, the success of such efforts has been relatively limited. Furthermore, layer 2 does not support multicast distribution tree building, which is used in layer 3 to distribute multicast data packets to their intended destinations.

The term packet is commonly associated with layer 3 (network layer) communications. At layer 2 (link layer), packets are commonly referred to as frames. The term “packet,” as used herein, should be understood to encompass both packets (in the layer 3 sense) and frames (in the layer 2 sense). The term “frame,” as used herein, more specifically refers to a packet which has been encapsulated for layer 2 transmission (e.g., by including a layer 2 address with header information associated with the packet).

FIG. 1 shows an example network 100. Network 100 includes a layer 3 device 102 and a layer 2 network device 112. In one embodiment, 102 is implemented as a router, though any other computing device capable of using layer 3 network protocols, such as multiprotocol label switching (MPLS) and Internet protocol (IP), for packet transmission can be used. Layer 2 network device 112 can be implemented, for example, as a switch, though any other computing device capable of using layer 2 protocols, such as Ethernet, for packet transmission can be used. Router 102 is shown coupled to switch 112. As shown, switch 112 receives packets, such as packet 132, from router 102 and forwards the packets to one or more hosts 142-146 using layer 2 network protocols. Each of hosts 142-146 is a user device, such as a personal computer, or any other computing device capable of networked computing operations. Each of hosts 142-146 is shown coupled to a respective port P1-Pn, of switch 112. In one embodiment, ports P1-Pn are Ethernet ports. Multiple hosts can be coupled to a single port.

In the example of FIG. 1 , packet 132 is a multicast data packet. That is, packet 132 includes information that identifies packet 132 as being a multicast data packet. In one embodiment, a MAC address is used to indicate that the packet is a multicast data packet. MAC addresses are typically 48-bit values used to forward packets at layer 2. In standard usage, bit 0 of the first byte of a MAC address is used to indicate whether the packet that includes the MAC address is a multicast data packet. If the bit is set to 1, the packet is a multicast data packet (or a broadcast packet). Setting bit 0 of the first byte of a MAC address included in packet 132 to 1 indicates that the packet is a multicast packet. Optionally, additional bits in the MAC address included in packet 132 can be used for multicast group address encoding. In response to receiving packet 132, and determining that bit 0 of the first byte of packet 132's MAC address is set to 1, switch 112 floods the packet to all of its ports. This results in copies 134-138 of packet 132 being forwarded to each host that is connected to switch 112.

One attempt to ameliorate unnecessary forwarding of packets at layer 2 is known as Internet group management protocol (IGMP) snooping. Generally, hosts signal their interest in joining or leaving a particular multicast group using an IGMP or multicast listener discovery (MLD). In the case of IGMP, a host sends an IGMP report to a layer 3 device, for example to a multicast control group or a membership group to which the layer 3 device listens. The IGMP report includes information (such as a multicast group address) identifying which multicast group is the subject of the IGMP report. The layer 3 device detects the IGMP report and determines whether the IGMP report is a join message indicating the host wishes to begin receiving multicast data packets associated with the multicast group or an unsubscribe message indicating the host wishes to cease receiving multicast data packets associated with the multicast group. In the case of a join message, the layer 3 device determines whether traffic associated with the multicast group is already forwarded to the switch from which the IGMP report was received. That is, if the layer 3 device has already received an IGMP report indicating that a host coupled to the switch wishes to join a given multicast group, the layer 3 device already forwards traffic for the multicast group to the switch. If the layer 3 device has not previously received an IGMP join from the layer 2 domain, the layer 3 device updates group membership information maintained by the layer 3 device to indicate that multicast data packets for the multicast group should be forwarded to the layer 2 domain, and begins forwarding traffic corresponding to the multicast group received at the layer 3 device to the switch. In the case of an unsubscribe message, the layer 3 device ensures (e.g., by updating the membership information) that layer 3 device will not forward subsequently received multicast data packets associated with the multicast group identified in the unsubscribe message to the switch.

IGMP snooping involves a switch detecting IGMP reports and determining, based on the IGMP reports, which (if any) multicast groups hosts connected to the switch wish to join. That is, a switch in the path between a host and an layer 3 device to which the host sends an IGMP report (or other membership message) can detect (snoop) the message. Using the limited multicast group addressing referred to above, the switch attempts to forward multicast data packets to the appropriate ports, e.g., ports to which hosts that have joined the multicast groups are connected. IGMP snooping involves a switch monitoring packets received from hosts connected to the switch's ports. If a switch detects that a packet being sent from a host includes multicast group membership information, e.g., if the packet includes an IGMP report, the switch parses the packet to determine which multicast group is identified by the IGMP report, and stores information associating the port from which the packet was received with the multicast group. For example, the switch updates a table that indicates which ports are subscribed to which multicast groups. The host then forwards subsequently received multicast data packets associated with those groups to the appropriate ports, rather than flooding the multicast data packets to all ports on the switch.

FIG. 2 shows an example layer 2 network domain 200 in which IGMP snooping is implemented. FIG. 2 includes some components that are similar to corresponding components of network 100 of FIG. 1 . Like components have like reference numerals.

The dashed line in FIG. 2 indicates that host 142 sends an IGMP report 150 to router 102. In one example, IGMP report 150 includes information indicating that host 142 wishes to join multicast group G1. Switch 112 monitors (snoops) traffic between host 142 and router 102. In response to detecting that the traffic includes IGMP report 150, switch 112 learns that host 142 wishes to subscribe to group G1. Switch 112 updates state information 114 with this information. State information 114 includes, for each multicast group, a list of which hosts are currently subscribed to the multicast group.

In response to receiving a packet, such as packet 132, from network device 102, switch 112 determines whether the packet is a multicast data packet, and if so, which multicast group address is included in the packet, e.g., encoded in the MAC address of the packet. Switch 112 then forwards a copy of packet 132 to only the host which has subscribed to the multicast group with which packet 132 is associated. In the example of FIG. 2 , state information 114 indicates that only host 142 is subscribed to G1, so switch 112 forwards a copy 134 to only host 142, rather than flooding copies of the packet to all of the ports on switch 112.

While state information 114, as learned using IGMP snooping, may prevent some unnecessary flooding, IGMP snooping is not an ideal solution to implement multicast functionality at layer 2. One limitation of IGMP snooping is that IGMP snooping involves switch examining each packet sent from a host to determine whether the packet includes multicast group membership information, such as an IGMP report. Examining each packet received from each host is extremely wasteful, in terms of processing resources, and represents a significant burden on network performance. Furthermore, given the imperfect implementation of layer 2 multicast group addressing, the procedure is still subject to unreliable performance. For example, multicast group address collisions are unavoidable. Additionally, IGMP snooping involves the switch maintaining state information for each multicast group, including a list of which hosts are currently subscribed to each multicast group. The number of multicast groups can be quite large. As the number of multicast groups increases, the volume of state information maintained by the switch also increases. Since the amount of state information that can be maintained by a switch is limited by the amount of memory available for such state information, it may be problematic to maintain all the state information learned by performing IGMP snooping. Therefore, IGMP snooping provides limited effectiveness at a high cost. While it is desirable to reduce or eliminate the unnecessary flooding of multicast data packets, it is desirable to do so without incurring the performance costs and limited effectiveness associated with traditional mechanisms such as IGMP snooping.

Bit Indexed Explicit Replication

Techniques are described below that are used to effectively implement multicast at layer 2 without triggering the problems discussed above. The techniques involve attaching receiver information to packets in the form of bits and forwarding the packets based on the receiver information. This not only prevents flooding packets unnecessarily, but also greatly reduces the amount of state information stored at layer 2 switches and is therefore also referred to as “stateless multicast.” More formally, the term Bit Indexed Explicit Replication (BIER) is used to describe these techniques. As suggested by the term, a bit position is used as an index into a forwarding table and packets are replicated only to specified ports associated with each of the bit positions. The present disclosure describes BIER in the context of layer 2. It should be understood that BIER is not limited to any particular network layer or routing protocol.

FIG. 3 is a simplified block diagram illustrating certain components of an example network 300. Network 300 includes a plurality of nodes 302-308. In one embodiment, nodes 302-308 are implemented as BIER-enabled switches. BIER-enabled switches are configured to forward packets using BIER. BIER-enabled switches 302-308 form a layer 2 network, or domain. Each BIER-enabled switch includes a plurality of ports. As shown in the example of FIG. 3 , each BIER-enabled switch includes four ports, P1, P2, P3, and P4. Switch 302 acts as an ingress switch for the layer 2 domain. Multicast data packets enter network 300 from one or more layer 3 network devices, such as layer 3 device 301, via switch 302. In one embodiment, layer 3 device 301 is implemented as a router, though any other computing device capable of implementing layer 3 protocols can be used.

Also shown in FIG. 3 are BIER-enabled hosts 320-326. Each BIER-enabled host is configured to participate in BIER. Each BIER-enabled host can be implemented as a personal computer, or other network capable device. Each of the BIER-enabled hosts is assigned a set identifier and bit position. In one embodiment, a dynamic host configuration protocol (DHCP) server (not shown) assigns set identifier and bit positions. In response to a BP being assigned to a host, the host advertises its BP, along with a uniquely identifying address, such as its MAC address, to some or all of the switches in the BIER network. In one embodiment, each BIER-enabled host incorporates information identifying the set identifier and bit position into a MAC address. The MAC address uniquely identifies the BIER-enabled host within the layer 2 domain and is discoverable by the switches in the layer 2 domain. The BIER-enabled host then transmits an address announcement to one or more other devices in the layer 2 domain using, for example, address resolution protocol (ARP) or neighbor discovery protocol (NDP).

Assigning a Bit Position in the Bit Mask

Each host in a layer 2 BIER network is assigned a unique bit position (BP) from a bit mask (BM). As used herein, the term bit mask refers to a set of bits that has a fixed or variable length. The length of the BM used in the BIER network can be statically configured or dynamically assigned and distributed through the BIER network. The BM can have any suitable length. In an embodiment, the length of the BM is determined in view of the size and capabilities of the network, and is between 8 and 4096 bits. The maximum length of the BM is determined, in one embodiment, by hardware or software limitations of the BIER-enabled elements (e.g., switches and hosts) in the BIER network. When included in a packet, the BM is sometimes referred to as a packet bit mask, a packet bit array, or as a bit string to differentiate the packet bit mask from a bit mask included in an entry in a table, such as a bit forwarding table.

In one embodiment, different BIER-enabled elements in the BIER network use different lengths for their respective BMs. For example, one BIER-enabled host may have a maximum BM length of 128 bits while another BIER-enabled host may have a maximum BM length of 256 bits. Various approaches to accommodate BIER networks where the number of BIER-enabled hosts exceeds the maximum number of bits in the BM are described below. A bit mask is one type of multicast forwarding entry in which each bit position of multiple bit positions is an element that can be used to represent an individual host. Other types of multicast forwarding entries with other types of values can be used. For example, an array of multi-bit entries, or any other multi-entry array in which each entry uniquely identifies a particular host, can be used.

A bit position (BP) assigned to a host is statically or dynamically assigned to the host. Each host should have at least one unique bit position from the BM. In one embodiment, a central authority, such as a controller, will assign the BPs to the hosts. Other mechanisms for assigning BPs can be implemented as well, such as deriving a BP from an address assigned to the host, or a network device to which the host is connected, where the derivation utilizes a mapping algorithm In some embodiments, a bit position in the BM is assigned to a single host. In other embodiments, a single BP can be assigned to more than one host. When multiple hosts are assigned the same BP, one of the multiple hosts can assume ownership of the BP at a given time, and ownership can be transferred between the multiple hosts. Ownership of the BP can be transferred to another one of the multiple hosts for any of several reasons, such as a failover in response to a node or link failure, or if one of the multiple hosts otherwise becomes unavailable, in response to changing network conditions, due to time-sharing considerations, and the like. Assigning one BP to multiple hosts facilitates operation similar to anycast, in which packets are forwarded to one receiver of a group of receivers, where each receiver in the group of receivers uses a common address.

As shown in the example of FIG. 3 , network 300 utilizes a four bit BM. Each of the four hosts shown in network 300 is assigned a BP: host 320 is assigned BP {0010}; host 322 is assigned BP {0001}; host 324 is assigned BP {1000}; and host 326 is assigned BP {0100}. While this description refers to hosts being assigned BPs, BPs could also be assigned to interfaces, such as ports, on a switch, or to the switch itself.

Sets

The number of hosts that can be addressed (assigned a BP) is limited by the size of the BM included in the multicast data packet. The concept of sets allows an increase in the number of hosts that can be assigned BPs. The set identifier (SI) is, for example, a number between 0 and 255. The SI allows a BP to be unique in the context of a set. For example, each BP can be re-used in each set. In an embodiment with 256 sets and a BM length of 256 bits, 65536 (256×256) hosts can be supported. In one embodiment, BIER-enabled switches in the BIER network generate separate forwarding information for each SI. For example, if two different set identifiers are in use in the BIER network, the BIER-enabled switches each generate two bit forwarding tables (BFTs), one corresponding to each SI. In response to receiving a multicast data packet having a SI, a BIER-enabled switch uses the SI to select which forwarding information (e.g., BFT) to use to forward the multicast data packet.

In addition to extending the number of hosts that can be assigned unique BPs, sets can also be used in the context of multi-topology routing (MTR) or to enable temporal slicing. For example, a set of BPs can be assigned to a group of hosts. The ERs use the assigned BPs for a specified time period. A second set of BPs is also assigned to the hosts. The second set of BPs is used for a second time period. In an embodiment implemented in a dual plane network, the controller can assign one plane a first SI and the second plane a second SI. In one embodiment, BPs within a set are assigned to hosts based on geographic proximity to other hosts in the set.

A controller can determine that conditions exist to switch from forwarding packets using BPs in one set to another. For example, the controller can detect expiration of a specified time period, or receive a signal to switch between topologies in an MTR environment. In one embodiment, the controller centrally determines clustering of hosts within an aggregate collection of transported multicast flows and dynamically assigns and reassigns a SI and BP to all affected hosts. This enables a larger number of hosts to be addressed by a smaller BM. To switch sets, the controller indicates which SI and BM the IR should include in outgoing multicast data packets. Based on the SI, BIER-enabled nodes in the network will select a BFT associated with the SI, and forward multicast data packets accordingly.

In one embodiment, the SI is included as part of the BM encoding in a multicast data packet. There are a number of methods that can be used to implement sets that facilitate determining the SI from the packet. The methods vary based at least in part on the type of encapsulation used to carry the BM value. For example, in an Ethernet frame, a separate Ethertype could be allocated to designate a field to contain information identifying which set a particular BM is associated with. In one embodiment, if hosts that have signaled interest in a given multicast flow have different SIs, then the ingress switch sends a copy of the multicast data packet for each SI.

The above description makes clear that a BP can be unique in the context of a domain, or BIER network, or can be unique to a given set. In one embodiment, BPs are unique within the context of a particular logical or physical division of a given BIER network. For example, if a BIER network is divided into multiple VLANs, with each VLAN containing only a portion of the BIER-enabled hosts in the entire BIER network, assigning BPs to be unique in the context of a specific VLAN results in being able to use a smaller number of unique BPs.

FIG. 4 shows an example method performed by a BIER-enabled host, such as one of BIER-enabled hosts 320-326 of FIG. 3 . At 402, the host obtains a bit position and set identifier. In one embodiment, the BIER-enabled host requests the set identifier and bit position from a central controlling authority, such as a control node or network administrator. The BP can be received automatically in response to the BIER-enabled host joining the BIER network, or can be received in response to the BIER-enabled host signaling an intent to participate in BIER. In one embodiment, BPs are assigned according to an arbitrary sequence, and the controller determines the next available BP and assigns the next available BP to the BIER-enabled host. For example, the controller can assign BP 1 to the first BIER-enabled host to join the BIER network, BP 2 to the second BIER-enabled host to join the BIER network, and so on. In one embodiment, the BPs can be derived based on information specific to the BIER-enabled host using a mapping algorithm. For example, the BP can be based on the address of the switch to which the host is coupled.

In response to receiving its BP, the BIER-enabled host advertises the assigned BP at 404. In one embodiment, the BIER-enabled host broadcasts an ARP message to all layer 2 devices in the layer 2 domain. The BIER-enabled host can advertise additional information, such as its bit mask size, and the like. Any available mechanism for transmitting information between the BIER-enabled elements of the layer 2 domain can be used to advertise the BP.

BIER MAC Address

FIG. 5 shows an example of a MAC address that can be used by a BIER-enabled host, such as one of BIER-enabled hosts 320-326 of FIG. 3 , to perform forwarding using BIER. The MAC address includes, at 505, an organizationally unique identifier (OUI). In one embodiment, the OUI is a 24 bit value that is associated with BIER. That is, the OUI indicates that the MAC address that includes the OUI is being used to uniquely identify a BIER-enabled host within a layer 2 domain. The OUI further indicates that the MAC address includes information that identifies a set and a bit position associated with the BIER-enabled host.

The MAC address includes another 24 bits, which are divided between a set identifier 510 and a bit position 515. In one embodiment, the bit position is encoded, using 12 bits, as an integer value which identifies which bit in a larger bit mask is associated with the host. For example, if a BIER-enabled host is assigned a BP that is the 14th bit in a 256-bit BM, the BP can be represented in binary using 12 bits as the number 14 (e.g., 0000 0000 1110). Set ID 510 can similarly be implemented using a binary representation of the set ID associated with the BIER-enabled host.

BM Routing and Forwarding Tables

Each BIER-enabled switch in the BIER network uses the BPs and MAC addresses of the other BIER-enabled switches in a domain to generate one or more bit routing tables (BRTs) and bit forwarding tables (BFTs). A bit routing table is a table that stores BP-to-port mappings. Each BIER-enabled switch receives information indicating which MAC addresses are reachable via which of the BIER-enabled switch's ports and stores the information in a BRT. In one embodiment, the BRT includes one entry for each BP assigned to a BIER-enabled host in the domain. Example BRTs and BFTs are described in the context of FIG. 3 .

FIG. 6A is an example of constructing and updating a bit routing table. In one embodiment, the method shown in FIG. 6A is performed by a BIER-enabled switch, such as switch 304 of FIG. 3 .

At 602, the switch receives information identifying a host, such as a MAC address. In one embodiment, the information includes an address announcement, for example using ARP. In one embodiment, the address announcement is received in response to an address query. An address query can be sent, for example, by a layer 3 device coupled to the layer 2 domain, another host in the layer 2 domain, or the switch. In another embodiment, the information is a data frame, and the source MAC field of the data frame is examined to discover a MAC address associated with the host from which the data frame was received. At 604, the switch determines whether the address announcement includes a BIER MAC address. In one embodiment, this involves examining an OUI included in the MAC address included in the address announcement to determine whether the OUI indicates that the MAC address is a BIER MAC address. In response to determining that the address announcement includes a BIER MAC address, the switch creates, at 606, an entry corresponding to the MAC address in a bit routing table.

At 608, the switch detects the value of the BP based on information included in the BIER MAC address. For example, the switch decodes a binary value included in a field of the MAC address (e.g., the 12 least significant bits) to detect which BP is indicated by the binary value. The switch also determines a value for a set identifier included in the MAC address. In one embodiment, this switch decodes a binary value included in a field of the MAC address (e.g., bits 13-24 of the MAC address) to detect which set identifier is indicated by the binary value. At 610, the switch determines the port via which the host corresponding to the MAC address in the address announcement is reachable. In one embodiment, this is the port via which the address announcement was received. In another embodiment, the switch looks up the MAC address in an address table maintained by the switch. The switch updates, at 612, the bit routing table. In one embodiment, this involves adding information identifying the BP corresponding to the MAC address associated with host that originated the address announcement and the port via which the host is reachable to the BRT entry that corresponds to the MAC address.

Using the example BIER network of FIG. 3 , FIGS. 6B and 6C show BRTs constructed by BIER-enabled switches 302 and 304, respectively. As shown in FIG. 6B, BIER-enabled switch 302 constructs a bit routing table 650. Bit routing table 650 includes a column 652 that stores information identifying the BIER-enabled hosts from which address announcements including information identifying BPs were received. In one embodiment, the host IDs in column 652 are implemented as MAC addresses. BRT 650 includes, at 654, a column that stores information identifying bit positions associated with the BIER-enabled hosts identified in column 652. At 656, BRT 650 includes a column that stores information identifying ports via which the BIER-enabled hosts identified in column 652 are reachable. In the example of FIG. 3 , BIER-enabled host H2 corresponds to BP 3 (e.g., the third bit is set as seen in {0100}). BIER-enabled host H2 is reachable from BIER-enabled switch 302 via port P3. Thus, in BRT 650, H2 is associated with BP 3 and P3.

FIG. 6C shows a bit routing table for BIER-enabled node 304. Bit routing table 670, similar to bit routing table 650, includes a column 672 that stores information identifying the BIER-enabled hosts from which address announcements were received. In one embodiment, the host ID is implemented as a MAC address. BRT 670 includes, at 674, a column that stores information identifying bit positions associated with the BIER-enabled hosts identified in column 672. At 676, BRT 670 includes a column that stores information identifying the ports via which the BIER-enabled hosts identified in column 672 are reachable. In the example of FIG. 3 , BIER-enabled host H2 is reachable from BIER-enabled switch 304 via port P4. Thus, in BRT 670, H2 is associated with BP 3 and P4.

Each BIER-enabled node translates its BRT(s) into one or more bit forwarding tables (BFTs). Generating a BFT involves, in one embodiment, first sorting the BRT by neighbor. In one embodiment, the BRT entries are sorted by BP. For entries in the BRT that have a common port, the BPs of those entries are OR′d together, creating a collapsed BM entry.

FIG. 7A shows an example of constructing and updating a bit forwarding table. In one embodiment, the method shown in FIG. 7A is performed by BIER-enabled switch, such as one of the BIER-enabled switches of FIG. 3 . At 702, the BIER-enabled switch sorts the entries in a BRT. The entries are sorted, for example, by port or by BP.

At 704, the BIER-enabled switch generates a BM for each entry. Generating the BM involves setting a corresponding bit in the BM for each host that is reachable via the port identified in the entry. In one embodiment, the BIER-enabled switch performs an OR operation between the BMs that have a single bit set, the set bit corresponding to a BIER-enabled host reachable via the port.

FIG. 7B shows a bit forwarding table 730. In one embodiment, BFT 730 is created by BIER-enabled switch 302 of FIG. 3 . BFT 730 includes a bit position column 732. Each bit position that has been assigned to a host has an entry. BFT also includes a BM column 734, which includes information identifying a bit mask which will be included in multicast data packets sent out from BIER-enabled switch 302, those multicast data packets being intended to reach the hosts corresponding to the bits indicated in bit position column 732. Port column 736 includes information identifying the ports via which the hosts that correspond to the BPs indicated in the BM column are reachable. In the example of FIG. 3 , hosts H2, H3, and H4, which correspond to BPs 1, 3, and 4 (which corresponds to a BM with the 1^(st), 3^(rd), and 4^(th) bits set as seen here {1101}) are reachable via port P3. Thus, the first entry in BFT 730, which corresponds to BP 1 has a BM with bits set corresponding to each host reachable via the corresponding port (P3).

Similar to bit forwarding table 730 of FIG. 7B, bit forwarding table 740 of FIG. 7C includes information used by a BIER-enabled node to forward multicast data packets. In one embodiment, BFT 740 is created by BIER-enabled node 304 of FIG. 3 . Bit forwarding table 740 includes a bit position column 742, a bit mask column 744, and a port column 746. In the example of FIG. 7C, in response to receiving a multicast data packet that includes a bit mask, a BIER-enabled switch determines how to forward the multicast data packet using BFT 740 and the BM in the multicast data packet. Since hosts corresponding to bit position 1 and bit position 4 are reachable via port P3, the corresponding BPs are aggregated to form BM 1001, which the BIER-enabled switch puts in the BFT entries corresponding to P3. The aggregation involves, in one embodiment, performing a logical OR operation between a BM that has only the BP corresponding to the respective host set. The host corresponding to bit position 3 is reachable via port P4. The corresponding bit is set in the BM of the BFT. The host corresponding to bit position 2 is reachable via port P2. The corresponding bit is set in the BM of the BFT.

Membership Information

A BIER-enabled host, such as BIER-enabled host 322 of FIG. 3 , joins a multicast group by sending a signaling message (e.g., using IGMP or any other out-of-band signaling mechanism) to a BIER-enabled layer 3 device, or router coupled to the layer 2 domain to which the BIER-enabled host is coupled. The message includes information identifying the multicast group the BIER-enabled host wishes to join.

The BIER-enabled layer 3 device, such as BIER-enabled router 301 of FIG. 3 , maintains state information that includes an entry for each multicast group that the BIER-enabled router receives multicast data packets for. In one embodiment, the BIER-enabled router maintains the state information in a group membership table (GMT), as shown at 354 of FIG. 3 . In one embodiment, each entry includes information identifying a multicast group (such as the multicast group name and/or an address of a source for the multicast group), a list of BPs corresponding to BIER-enabled hosts that have expressed interest (e.g., via a signaling message) in the multicast group identified in the group field, and a BM, which identifies all of the BIER-enabled hosts that have expressed interest in the multicast group (e.g., by having a bit set in the bit position corresponding to each host that has expressed interest in the multicast group).

In response to receiving a signaling message from a BIER-enabled host indicating that the BIER-enabled host is interested in a multicast group, the BIER-enabled router sets the bit corresponding to the BIER-enabled host's BP in the BM that corresponds to the multicast group. When the BIER-enabled host is no longer interested in receiving multicast data packets for the multicast group, the BIER-enabled host signals to the BIER-enabled router, e.g., using an unsubscribe message, and the BIER-enabled router clears the corresponding bit in the BM.

The BIER-enabled network devices in the layer 2 domain forward multicast data packets through the layer 2 domain and to the BIER-enabled hosts based on the BM. The BIER-enabled router transmits the BM along with multicast data packets into the layer 2 domain. There are number of different techniques available for transmitting the BM. This description refers to encapsulating the BM into the multicast data packet. This terminology covers not only incorporating the BM into the multicast data packet (e.g., as header or payload information), but also appending or prepending some or all of the BM to the multicast data packet.

FIG. 8A shows an example method performed by BIER-enabled router, such as BIER-enabled router 301 of FIG. 3 . At 802, the BIER-enabled router receives a signaling message. In one embodiment, the signaling message is implemented as an IGMP report received from a BIER-enabled host, such as one of hosts 320-326 of FIG. 3 .

At 804, the BIER-enabled router determines a multicast group ID from the signaling message. At 806, the BIER-enabled router updates a group membership table corresponding to the multicast group ID. Updating the GMT involves adding information identifying the BIER-enabled host that originated the signaling message, such as a set identifier and BP associated with the BIER-enabled host, to a list of information that identifies the BIER-enabled hosts that are subscribed to the multicast group identified by the signaling message. Alternatively, updating the GMT can involve removing information identifying the BIER-enabled host that originated the signaling message, for example if the message is an unsubscribe message. In one embodiment, the BIER-enabled router examines a source MAC address in the packet that included the signaling message to determine the BIER-enabled host that originated the signaling message. In one embodiment, the BIER-enabled router uses its BRT to determine the BP associated with the BIER-enabled host.

In the example of FIG. 3 , as indicated by the dashed lines, BIER-enabled hosts 322 and 326 transmit signaling messages to BIER-enabled router 301 indicating their interest in joining multicast group G1. BIER-enabled router 301 updates GMT 354 to add information identifying the BPs associated with these BIER-enabled hosts to a BM for G1.

Bit Mask Encapsulation

FIG. 8B shows an example method performed by a BIER-enabled router, such as BIER-enabled router 301 of FIG. 3 . At 852, the BIER-enabled router receives a multicast data packet. In one embodiment, the multicast data packet is received from a layer 3 device (not shown) to which the BIER-enabled router is coupled. In one embodiment, a destination address included in the multicast data packet identifies the multicast data packet as being a multicast data packet. For example, a IP destination address can include information identifying a multicast group, or a destination MAC address can include a multicast group address or translated IP multicast group address having a bit set in the bit position in the destination MAC address that indicates that the packet is to be forwarded using multicast.

At 854, the BIER-enabled router identifies the multicast group associated with the multicast data packet. In one embodiment, this involves examining the IP multicast group address included in the multicast data packet payload. Alternatively, the BIER-enabled router identifies the multicast group based on the destination MAC address of the multicast data packet. The BIER-enabled router then looks up a bit mask for the group. In one embodiment, this involves accessing a group membership table maintained by the BIER-enabled router.

At 856, the BIER-enabled router encapsulates the bit mask into the multicast data packet. In one embodiment, this involves incorporating and/or updating a destination MAC address, a source MAC address, a BIER tag, and a BM into the multicast data packet. Additional encapsulation details are discussed with regard to FIG. 9 . At 858, the BIER-enabled router forwards the multicast data packet using the bit mask. Additional details regarding forwarding the multicast data packet in a layer 2 network are discussed with regard to FIG. 10 . Using the example shown in FIG. 3 , the BIER-enabled router 301 receives a multicast data packet for multicast group G1. BIER-enabled router 301 includes the BM for G1 {0101} in the multicast data packet before forwarding the multicast data packet using its BFT.

FIG. 9 shows an example of a BIER multicast frame. At 905, the frame includes a MAC destination address, implemented as a 48-bit value. The value 01 00 5B 00 00 00 is a MAC address that indicates that the packet that includes the MAC address is a multicast data packet. At 910, the packet includes a MAC source address, which identifies the sender of the packet. At 915, the packet includes a BIER tag that indicates that the packet is a BIER packet that includes a bit mask. The bit mask is included in the packet at 920. As described above, the bit mask can be, for example, a 256 bit value where each bit is associated with a particular host. At 925, the packet includes an Ethertype value which indicates the protocol of the payload information that follows. At 930, the frame includes payload information.

Forwarding

FIG. 10 is a flow chart illustrating an example method of forwarding a packet using BIER. The method can be performed by a layer 2 device, such as one of BIER-enabled switches 302-308 of FIG. 3 . At 1002, the BIER-enabled switch receives a multicast data packet. The BIER-enabled switch determines, at 1004, whether a BIER tag is present in the multicast data packet. If not, the BIER-enabled switch performs alternate processing at 1026. In one embodiment, alternate processing 1026 involves flooding the multicast data packet to all ports on the BIER-enabled switch.

If the multicast data packet does include a BIER tag, the BIER-enabled switch knows that the multicast data packet includes a bit mask. The BIER-enabled switch locates the bit mask in the multicast data packet at 1006. Using the bit-mask, the BIER-enabled switch determines which ports the packet should be forwarded to. In one embodiment, this involves determining, as shown at 1008, whether the first bit of the bit mask is set, as shown in 1010. If the bit is not set, the BIER-enabled switch determines, at 1022, whether more bits are present in the bit-mask. If so, the BIER-enabled switch selects the next bit at 1024 and the method return to 1010.

At 1010, the BIER-enabled switch determines whether the bit is set. In response to determining that a bit in the bit mask is set, the BIER-enabled switch forwards a copy of the packet to the port via which a host corresponding to the set bit is reachable. This involves, at 1016 creating a copy of the packet and updating the bit mask. In one embodiment, updating the bit mask in the copy of the packet involves clearing bits in the bit-mask which are not reachable via the port via which the copy of the packet is being forwarded. This can be accomplished by performing an AND operation between the bit mask from the incoming multicast data packet and the bit mask in the forwarding table entry that corresponds to the selected bit. The resulting value is used as the bit mask for the copy of the multicast data packet. At 1018, the BIER-enabled switch forwards the multicast packet to the port.

At 1020, the BIER-enabled switch updates the bit mask that arrived in the packet by clearing those bits in the multicast data packet's bit mask that correspond to the bits which were set in the multicast data packet that the BIER-enabled switch forwarded. In one embodiment, this involves performing an AND operation between the bit mask in the received multicast data packet, and the inverse of the bit mask in the entry corresponding to the selected bit. This has the effect of clearing those bits that correspond to bit positions which were set in the bit mask of the outgoing packet, which prevents looping and duplication. The BIER-enabled switch then determines, at 1022, whether more bits are present in the bit mask. The BIER-enabled switch then continues to walk to the bit mask of the received multicast data packet, bit-by-bit, until the end of the bit mask is reached.

Consider the following example, which illustrates the method described above of forwarding a multicast data packet. In this example, a multicast data packet arrives at BIER-enabled switch B (e.g., 304 of FIG. 3 ) having a bit mask of 0101, which corresponds, according to GMT 354 of FIG. 3 , with multicast group G1. BIER-enabled switch B uses the BFT 740 shown in FIG. 7C.

In accordance with 1010 of FIG. 10 , BIER-enabled switch B determines that the first bit of the bit mask (0101) is set. As indicated in bit forwarding table 740, the BIER-enabled host that corresponds to bit 1 is reachable via port P3. BIER-enabled switch B creates a copy of the multicast data packet. BIER-enabled switch B then updates the bit mask in the copy of the packet by performing a logical AND operation using the BM in the copy of the multicast data packet, which is 0101 and the bit mask in the entry corresponding to bit position 1, which is 1001. The result of the AND operation is 0001. BIER-enabled switch B updates the bit mask of the copy of the multicast data packet to 0001 and forwards the copy of the multicast data packet to port P3.

Next, BIER-enabled switch B updates the bit mask of the received multicast data packet by performing a logical AND operation between the bit mask of the received multicast data packet with the inverse of the entry used to forward the copy of the multicast data packet. The inverse of the BM in the entry used to forward the copy of the multicast data packet, which was 0001, is 1110. When 1110 is ANDed with the packet bit mask of the received multicast data packet (0101), the result is 0100. BIER-enabled switch B updates the bit mask of the received multicast data packet to be 0100.

In accordance with 1022 of FIG. 10 , BIER-enabled switch B determines whether more bits are included in the bit mask of the received multicast data packet. Bit 2 is not set, but bit 3 is. As indicated in bit forwarding table 740, the BIER-enabled host that corresponds to bit 3 is reachable via port P4. BIER-enabled switch B creates a copy of the multicast data packet. BIER-enabled switch B then updates the bit mask in the copy of the packet by performing a logical AND operation using the BM in the copy of the multicast data packet, which is 0100 and the bit mask in the entry corresponding to bit position 3, which is 0100. The result of the AND operation is 0100. BIER-enabled switch B updates the bit mask of the copy of the multicast data packet to 0100 and forwards the copy of the multicast data packet to port P4.

Next, BIER-enabled switch B updates the bit mask of the received multicast data packet by performing a logical AND operation between the bit mask of the received multicast data packet with the inverse of the entry used to forward the copy of the multicast data packet. The inverse of the BM in the entry used to forward the copy of the multicast data packet, which was 0100, is 1011. When 1011 is ANDed with the packet bit mask of the received multicast data packet (0100), the result is 0000. BIER-enabled switch B updates the bit mask of the received multicast data packet to be 0000.

In accordance with 1022 of FIG. 10 , BIER-enabled switch B determines whether more bits are included in the bit mask of the received multicast data packet. There are, but since none of the bits are set (the bit mask was updated to 0000), the method ends, as far as BIER-enabled switch B is concerned.

FIG. 11 is a block diagram illustrating certain additional and/or alternative components of nodes that can be employed, for example in the network shown in FIG. 3 . In this depiction, node 1100 includes a number of line cards (line cards 1102(1)-(N)) that are communicatively coupled to a forwarding engine or packet forwarder 1110 and a processor 1120 via a data bus 1130 and a result bus 1140. Line cards 1102(1)-(N) include a number of port processors 1150(1,1)-(N,N) which are controlled by port processor controllers 1160(1)-(N). It will also be noted that forwarding engine 1110 and processor 1120 are not only coupled to one another via data bus 1130 and result bus 1140, but are also communicatively coupled to one another by a communications link 1170.

The processors 1150 and 1160 of each line card 1102 may be mounted on a single printed circuit board. When a packet or packet and header are received, the packet or packet and header may be identified and analyzed by router 1100 in the following manner Upon receipt, a packet (or some or all of its control information) or packet and header is sent from the one of port processors 1150(1,1)-(N,N) at which the packet or packet and header was received to one or more of those devices coupled to data bus 1130 (e.g., others of port processors 650(1,1)-(N,N), forwarding engine 1110 and/or processor 1120). Handling of the packet or packet and header can be determined, for example, by forwarding engine 1110. For example, forwarding engine 1110 may determine that the packet or packet and header should be forwarded to one or more of port processors 1150(1,1)-(N,N). This can be accomplished by indicating to corresponding one(s) of port processor controllers 1160(1)-(N) that the copy of the packet or packet and header held in the given one(s) of port processors 1150(1,1)-(N,N) should be forwarded to the appropriate one of port processors 1150(1,1)-(N,N). In addition, or alternatively, once a packet or packet and header has been identified for processing, forwarding engine 1110, processor 1120 or the like can be used to process the packet or packet and header in some manner or add packet security information, in order to secure the packet. On a node sourcing such a packet or packet and header, this processing can include, for example, encryption of some or all of the packet's or packet and header's information, the addition of a digital signature or some other information or processing capable of securing the packet or packet and header. On a node receiving such a processed packet or packet and header, the corresponding process is performed to recover or validate the packet's or packet and header's information that has been thusly protected.

FIG. 12 is a block diagram of a computing device, illustrating how a forwarding module can be implemented in software, as described above. Computing system 1210 broadly represents any single or multi-processor computing device or system capable of executing computer-readable instructions. Examples of computing system 1210 include, without limitation, any one or more of a variety of devices including workstations, personal computers, laptops, client-side terminals, servers, distributed computing systems, handheld devices (e.g., personal digital assistants and mobile phones), network appliances, switches, routers, storage controllers (e.g., array controllers, tape drive controller, or hard drive controller), and the like. In its most basic configuration, computing system 1210 may include at least one processor 1214 and a system memory 1216. By executing the software that implements a forwarding module 1212, computing system 1210 becomes a special purpose computing device that is configured to perform packet forwarding, in the manner described above.

Processor 1214 generally represents any type or form of processing unit capable of processing data or interpreting and executing instructions. In certain embodiments, processor 1214 may receive instructions from a software application or module. These instructions may cause processor 1214 to perform the functions of one or more of the embodiments described and/or illustrated herein. For example, processor 1214 may perform and/or be a means for performing the operations described herein. Processor 1214 may also perform and/or be a means for performing any other operations, methods, or processes described and/or illustrated herein.

System memory 1216 generally represents any type or form of volatile or non-volatile storage device or medium capable of storing data and/or other computer-readable instructions. Examples of system memory 1216 include, without limitation, random access memory (RAM), read only memory (ROM), flash memory, or any other suitable memory device. Although not required, in certain embodiments computing system 1210 may include both a volatile memory unit (such as, for example, system memory 1216) and a non-volatile storage device (such as, for example, primary storage device 1232, as described in detail below). In one example, program instructions executable to implement a forwarding module configured to forward multicast data packets may be loaded into system memory 1216.

In certain embodiments, computing system 1210 may also include one or more components or elements in addition to processor 1214 and system memory 1216. For example, as illustrated in FIG. 12 , computing system 1210 may include a memory controller 1218, an Input/Output (I/O) controller 1220, and a communication interface 1222, each of which may be interconnected via a communication infrastructure 1212. Communication infrastructure 1214 generally represents any type or form of infrastructure capable of facilitating communication between one or more components of a computing device. Examples of communication infrastructure 1214 include, without limitation, a communication bus (such as an Industry Standard Architecture (ISA), Peripheral Component Interconnect (PCI), PCI express (PCIe), or similar bus) and a network.

Memory controller 1218 generally represents any type or form of device capable of handling memory or data or controlling communication between one or more components of computing system 1210. For example, in certain embodiments memory controller 1218 may control communication between processor 1214, system memory 1216, and I/O controller 1220 via communication infrastructure 1214. In certain embodiments, memory controller 1218 may perform and/or be a means for performing, either alone or in combination with other elements, one or more of the operations or features described and/or illustrated herein.

I/O controller 1220 generally represents any type or form of module capable of coordinating and/or controlling the input and output functions of a computing device. For example, in certain embodiments I/O controller 1220 may control or facilitate transfer of data between one or more elements of computing system 1210, such as processor 1214, system memory 1216, communication interface 1222, display adapter 1226, input interface 1230, and storage interface 1234.

Communication interface 1222 broadly represents any type or form of communication device or adapter capable of facilitating communication between computing system 1210 and one or more additional devices. For example, in certain embodiments communication interface 1222 may facilitate communication between computing system 1210 and a private or public network including additional computing systems. Examples of communication interface 1222 include, without limitation, a wired network interface (such as a network interface card), a wireless network interface (such as a wireless network interface card), a modem, and any other suitable interface. In at least one embodiment, communication interface 1222 may provide a direct connection to a remote server via a direct link to a network, such as the Internet. Communication interface 1222 may also indirectly provide such a connection through, for example, a local area network (such as an Ethernet network), a personal area network, a telephone or cable network, a cellular telephone connection, a satellite data connection, or any other suitable connection.

In certain embodiments, communication interface 1222 may also represent a host adapter configured to facilitate communication between computing system 1210 and one or more additional network or storage devices via an external bus or communications channel. Examples of host adapters include, without limitation, Small Computer System Interface (SCSI) host adapters, Universal Serial Bus (USB) host adapters, Institute of Electrical and Electronics Engineers (IEEE) 11054 host adapters, Serial Advanced Technology Attachment (SATA) and external SATA (eSATA) host adapters, Advanced Technology Attachment (ATA) and Parallel ATA (PATA) host adapters, Fibre Channel interface adapters, Ethernet adapters, or the like.

Communication interface 1222 may also allow computing system 1210 to engage in distributed or remote computing. For example, communication interface 1222 may receive instructions from a remote device or send instructions to a remote device for execution.

As illustrated in FIG. 12 , computing system 1210 may also include at least one display device 1224 coupled to communication infrastructure 1214 via a display adapter 1226. Display device 1224 generally represents any type or form of device capable of visually displaying information forwarded by display adapter 1226. Similarly, display adapter 1226 generally represents any type or form of device configured to forward graphics, text, and other data from communication infrastructure 1214 (or from a frame buffer) for display on display device 1224.

As illustrated in FIG. 12 , computing system 1210 may also include at least one input device 1228 coupled to communication infrastructure 1214 via an input interface 1230. Input device 1228 generally represents any type or form of input device capable of providing input, either computer or human generated, to computing system 1210. Examples of input device 1228 include, without limitation, a keyboard, a pointing device, a speech recognition device, or any other input device.

As illustrated in FIG. 12 , computing system 1210 may also include a primary storage device 1232 and a backup storage device 1233 coupled to communication infrastructure 1214 via a storage interface 1234. Storage devices 1232 and 1233 generally represent any type or form of storage device or medium capable of storing data and/or other computer-readable instructions. For example, storage devices 1232 and 1233 may be a magnetic disk drive (e.g., a so-called hard drive), a floppy disk drive, a magnetic tape drive, an optical disk drive, a flash drive, or the like. Storage interface 1234 generally represents any type or form of interface or device for transferring data between storage devices 1232 and 1233 and other components of computing system 1210. A storage device like primary storage device 1232 can store information such as routing tables and forwarding tables.

In certain embodiments, storage devices 1232 and 1233 may be configured to read from and/or write to a removable storage unit configured to store computer software, data, or other computer-readable information. Examples of suitable removable storage units include, without limitation, a floppy disk, a magnetic tape, an optical disk, a flash memory device, or the like. Storage devices 1232 and 1233 may also include other similar structures or devices for allowing computer software, data, or other computer-readable instructions to be loaded into computing system 1210. For example, storage devices 1232 and 1233 may be configured to read and write software, data, or other computer-readable information. Storage devices 1232 and 1233 may also be a part of computing system 1210 or may be a separate device accessed through other interface systems.

Many other devices or subsystems may be connected to computing system 1210. Conversely, all of the components and devices illustrated in FIG. 12 need not be present to practice the embodiments described and/or illustrated herein. The devices and subsystems referenced above may also be interconnected in different ways from that shown in FIG. 12 .

Computing system 1210 may also employ any number of software, firmware, and/or hardware configurations. For example, one or more of the embodiments disclosed herein may be encoded as a computer program (also referred to as computer software, software applications, computer-readable instructions, or computer control logic) on a computer-readable storage medium. Examples of computer-readable storage media include magnetic-storage media (e.g., hard disk drives and floppy disks), optical-storage media (e.g., CD- or DVD-ROMs), electronic-storage media (e.g., solid-state drives and flash media), and the like. Such computer programs can also be transferred to computing system 1210 for storage in memory via a network such as the Internet or upon a carrier medium.

The computer-readable medium containing the computer program may be loaded into computing system 1210. All or a portion of the computer program stored on the computer-readable medium may then be stored in system memory 1216 and/or various portions of storage devices 1232 and 1233. When executed by processor 1214, a computer program loaded into computing system 1210 may cause processor 1214 to perform and/or be a means for performing the functions of one or more of the embodiments described and/or illustrated herein. Additionally or alternatively, one or more of the embodiments described and/or illustrated herein may be implemented in firmware and/or hardware. For example, computing system 1210 may be configured as an application specific integrated circuit (ASIC) adapted to implement one or more of the embodiments disclosed herein.

A block diagram of an exemplary network device that may be associated with a node in network 300 of FIG. 3 is shown in FIG. 13 . Network device 1350 of FIG. 13 may, for example, be associated with BIER-enabled switch 302 in FIG. 3 . In some cases “node” as used herein encompasses one or more network devices associated with the node. “Network devices” as used herein includes various devices, such as routers, switches, or network controllers, that perform routing and/or forwarding functions and support one or more routing and/or switching protocols. A network device maintains one or more routing and/or forwarding tables that store routing and/or forwarding information identifying paths to various data sources and/or data consumers. In, for example, a multicast-enabled node, a network device implements a multicast routing protocol that is used to convey multicast data packets from a multicast source to a multicast receiver. For each multicast group to which a multicast source sends data, the multicast routing protocol can establish a multicast distribution tree, which is a group of coupled nodes that can convey packets from the multicast source to the multicast receivers.

In the embodiment of FIG. 13 , network device 1350 includes storage for routing information 1352, storage for forwarding information 1364, a forwarding module 1360, and an interface 1362. Interface 1362 is coupled to send and receive packets. It is noted that network device 1350 may include additional interfaces, and that each interface can be a logical or physical interface. In one embodiment, interface 1362 includes one or more ports.

Forwarding module 1360 is configured to perform forwarding based on the stored forwarding information 1364. Forwarding module 1360 is also configured to update the stored routing information 1352 and forwarding information 1364. Forwarding module 1360 can implement one or more instances of a layer 2 forwarding protocol.

Entry 1370 provides an example of routing information stored in memory of a network device. As shown, entry 1370 includes a MAC address 1354, information 1356 identifying a bit position (BP), and information 1358 identifying a port. The MAC address and BP identify a host with entry 1370 is associated, and the port information identifies to which port within interface 1362 packets addressed to the host are properly forwarded. The storage for routing information 1352 is, in one embodiment, implemented as a bit indexed routing table, or bit routing table (BRT).

Entry 1372 provides an example of forwarding information that can be stored in memory of a network device. As shown, entry 1372 includes information 1366 identifying a BP, a bit mask or bit array 1368, and information 1369 identifying a port. Forwarding module 1360 uses the information in entry 1372 to forward to the port identified in the entry. For example, when a packet is received, the forwarding engine accesses entry 1372 and determines, using the BM, which port(s) the packet should be forwarded to.

The storage for forwarding information 1364 is, in one embodiment, implemented as a bit indexed forwarding table, or bit forwarding table (BFT).

Although the present invention has been described in connection with several embodiments, the invention is not intended to be limited to the specific forms set forth herein. On the contrary, it is intended to cover such alternatives, modifications, and equivalents as can be reasonably included within the scope of the invention as defined by the appended claims. 

What is claimed is:
 1. A method comprising: receiving, by a router, a data packet from another router coupled thereto; updating, by the router, the data packet by incorporating a bit mask and a tag into the data packet to create a modified data packet, wherein the tag indicates that the modified data packet comprises the bit mask for determining one or more ports for forwarding the modified data packet; and forwarding, by the router, the modified data packet to a switch coupled thereto, wherein the switch determines based on the tag being set, the one or more ports of a plurality of ports for forwarding the modified data packet and based on the tag not being set, to flood the modified data packet to the plurality of ports of the switch, and wherein the switch generates a copy of the modified data packet for each of the one or more ports and updates the bit mask in the modified data packet.
 2. The method of claim 1, further comprising: the router identifying a multicast group associated with the data packet; and the router accessing a table in memory that maps the multicast group to the bit mask before the router incorporates the bit mask with the data packet.
 3. The method of claim 2, wherein the data packet comprises an address comprising information indicating the data packet is a multicast data packet.
 4. The method of claim 3, wherein the address comprises an IP destination address that comprises information identifying a multicast group.
 5. The method of claim 3, wherein the address comprises a destination MAC address that comprises a multicast group address.
 6. The method of claim 3, wherein the address comprises a destination MAC address that comprises a multicast group address that includes a bit set to a first state to indicate that the data packet is a multicast data packet.
 7. The method of claim 1, wherein the bit mask comprises a plurality of bits and wherein a plurality of hosts are assigned respective bit positions in the bit mask.
 8. The method of claim 1, wherein: the copy of the modified data packet for a respective port of the one or more ports includes an updated bit mask in which at least one bit of the bit mask, corresponding to a host that cannot be reach from the respective port, is cleared.
 9. The method of claim 8, further comprising: clearing, by the switch, the at least one bit of the bit mask by performing an operation between the bit mask and a forwarding table.
 10. The method of claim 9, wherein the operation involves performing an AND operation between each bit in the bit mask and a corresponding bit in the forwarding table that correlates a bit position of the bit mask to a respective port of the switch and a host identifier.
 11. A router comprising: a microprocessor, and a non-transient computer readable storage medium, wherein the non-transient computer readable storage medium comprises program instructions executable to perform a method comprising: receiving a data packet from another router coupled thereto; incorporating a bit mask and a tag with the data packet to create a modified data packet, wherein the tag indicates that the modified data packet comprises the bit mask for determining one or more ports for forwarding the modified data packet; and forwarding the modified data packet to a switch, which determines based on the tag being set, the one or more ports of a plurality of ports for forwarding the modified data packet and based on the tag not being set, to flood the modified data packet to the plurality of ports of the switch and which generates a copy of the modified data packet for each of the one or more ports and updates the bit mask in the modified data packet.
 12. The router of claim 11, wherein the method further comprises: identifying a multicast group associated with the data packet; and accessing a table in memory that maps the multicast group to the bit mask before the router incorporates the bit mask with the data packet.
 13. The router of claim 12, wherein the data packet comprises an address comprising information indicating the data packet is a multicast data packet.
 14. The router of claim 13, wherein the address comprises an IP destination address that comprises information identifying a multicast group.
 15. The router of claim 11, wherein the bit mask comprises a plurality of bits, wherein a plurality of hosts are assigned respective bit positions in the bit mask.
 16. A system comprising: a switch; and a router coupled to the switch, the router comprising: a microprocessor, and a non-transient computer readable storage medium, wherein the non-transient computer readable storage medium comprises program instructions executable to perform a method comprising: receiving a data packet from another router coupled thereto; incorporating a bit mask and a tag with the data packet to create a modified data packet, wherein the tag indicates that the modified data packet comprises the bit mask for determining one or more ports for forwarding the modified data packet; and forwarding the modified data packet to a switch, which determines based on the tag being set, the one or more ports of a plurality of ports for forwarding the modified data packet and based on the tag not being set, to flood the modified data packet to the plurality of ports of the switch and which generates a copy of the modified data packet for each of the one or more ports and updates the bit mask in the modified data packet.
 17. The system of claim 16, wherein the method further comprises: identifying a multicast group associated with the data packet; and accessing a table in memory that maps the multicast group to the bit mask before the router incorporates the bit mask with the data packet.
 18. The system of claim 17, wherein the method further comprises the router receiving a signaling message from a link layer destination device indicating that the link layer destination device is interested in the multicast group.
 19. The system of claim 18, wherein the method further comprises an act of updating the table using information contained in the signaling message.
 20. The system of claim 16, wherein the bit mask comprises a plurality of bits and wherein a plurality of link layer destination devices are assigned respective bit positions in the bit mask. 